Curvature of Approximating Curve Subdivision Schemes
نویسندگان
چکیده
The promise of modeling by subdivision is to have simple rules that avoid cumbersome stitching-together of pieces. However, already in one variable, exactly reproducing a variety of basic shapes, such as conics and spirals, leads to non-stationary rules that are no longer as simple; and combining these pieces within the same curve by one set of rules is challenging. Moreover, basis functions, that allow reading off smoothness and computing curvature, are typically not available. Mimicking subdivision of splines with non-uniform knots allows us to combine the basic shapes. And to analyze non-uniform subdivision in general, the literature proposes interpolating the sequence of subdivision control points by circles. This defines a notion of discrete curvature for interpolatory subdivision. However, we show that this discrete curvature generically yields misleading information for non-interpolatory subdivision and typically does not converge, not even for non-uniform spline subdivision. Analyzing the causes yields three general approaches for solving or at least mitigating the problem: equalizing parameterizations, sampling subsequences and a new skip-interpolating subdivision approach.
منابع مشابه
A Subdivision-Regularization Framework for Preventing Over Fitting of Data by a Model
First, we explore the properties of families of odd-point odd-ary parametric approximating subdivision schemes. Then we fine-tune the parameters involved in the family of schemes to maximize the smoothness of the limit curve and error bounds for the distance between the limit curve and the kth level control polygon. After that, we present the subdivision-regularization framework for preventing ...
متن کاملTernary approximating non - stationary subdivision schemes for curve design
In this paper, an algorithm has been introduced to produce ternary 2m-point (for any integer m≥ 1) approximating non-stationary subdivision schemes which can generate the linear spaces spanned by {1; cos(α.); sin(α.)}. The theory of asymptotic equivalence is being used to analyze the convergence and smoothness of the schemes. The proposed algorithm can be consider as the non-stationary counter ...
متن کاملUnification and Application of 3-point Approximating Subdivision Schemes of Varying Arity
In this paper, we propose and analyze a subdivision scheme which unifies 3-point approximating subdivision schemes of any arity in its compact form and has less support, computational cost and error bounds. The usefulness of the scheme is illustrated by considering different examples along with its comparison with the established subdivision schemes. Moreover, B-splines of degree 4and well know...
متن کاملTuning Subdivision by Minimising Gaussian Curvature Variation Near Extraordinary Vertices
We present a method for tuning primal stationary subdivision schemes to give the best possible behaviour near extraordinary vertices with respect to curvature variation. Current schemes lead to a limit surface around extraordinary vertices for which the Gaussian curvature diverges, as demonstrated by Karčiauskas et al. [KPR04]. Even when coefficients are chosen such that the subsubdominant eige...
متن کاملThe m-Point Quaternary Approximating Subdivision Schemes
In this article, the objective is to introduce an algorithm to produce the quaternary m-point (for any integer ) approximating subdivision schemes, which have smaller support and higher smoothness, comparing to binary and ternary schemes. The proposed algorithm has been derived from uniform B-spline basis function using the Cox-de Boor recursion formula. In order to determine the convergence an...
متن کامل